A new universal cellular automaton on the ternary heptagrid
نویسنده
چکیده
In this paper, we construct a new weakly universal cellular automaton on the ternary heptagrid. The previous result, obtained by the same author and Y. Song required six states only. This time, the number of states is four. This is the best result up to date for cellular automata in the hyperbolic plane.
منابع مشابه
A weakly universal universal cellular automaton in the heptagrid
A weakly universal cellular automaton in the heptagrid. Abstract In this paper, we construct a weakly universal cellular automaton in the heptagrid, the tessellation {7, 3} which is not rotation invariant but which is truly planar. This result, under these conditions, cannot be improved for the tessellations {p, 3}.
متن کاملCellular Automata in the Hyperbolic Plane: Proposal for a New Environment
In this paper, we deal with new environment to visualise and to interact with cellular automata implemented in a grid of the hyperbolic plane. We use two kinds of tiling: the ternary heptagrid and the rectangular pentagrid. We show that both grids have the same spanning tree: the same numbering with maximal Fibonacci numbers can be used to identify all tiles. We give all the materials to comput...
متن کاملOn a Characterization of Cellular Automata in Tilings of the Hyperbolic Plane
In this paper, we look at the extension of Hedlund’s characterization of cellular automata to the case of cellular automata in the hyperbolic plane. This requires an additional condition. The new theorem is proved with full details in the case of the pentagrid and in the case of the ternary heptagrid and enough indications to show that it holds also on the grids {p, q} of the hyperbolic plane.
متن کاملA weakly universal cellular automaton in the hyperbolic 3D space with three states
In this paper, we follow the track of previous papers by the same author, with various collaborators or alone, see [2, 7, 13, 14, 10, 9], which make use of the same basic model, the railway model, see [16, 5, 9]. In order to be within the space constraint for the paper, we just refer to the above mentioned paper both for what is the railway model and for what is hyperbolic geometrY. For the lat...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0903.2108 شماره
صفحات -
تاریخ انتشار 2009